A Dynamic Scheduling Algorithm for Divisible Loads in Grid Environments

نویسندگان

  • Nguyen The Loc
  • Said Elnaffar
چکیده

Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time, however, a handful of solutions have been proposed. Furthermore, almost all proposed approaches attempt to perform scheduling in dedicated environments such as LANs, whereas scheduling in non-dedicated environments such as Grids remains an open problem. In Grids, the incessant variation of a worker's computing power is a chief difficulty of splitting and distributing workloads to Grid workers efficiently. In this paper, we first introduce a computation model that explains the impact of local (internal) tasks and Grid (external) tasks that arrive at a given worker. This model helps estimate the available computing power of a worker under the fluctuation of the number of local and Grid applications. Based on this model, we propose the CPU power prediction strategy. Additionally, we build a new dynamic scheduling algorithm by incorporating the prediction strategy into a static scheduling algorithm. Lastly we demonstrate that the proposed dynamic algorithm is superior to the existing dynamic and static algorithms by a comprehensive set of simulations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Methodology for Dynamic Scheduling of Divisible Workloads in Grid Environments

Scheduling divisible workloads in distributed systems has been one of the interesting research problems over the last few years. Most of the scheduling algorithms previously introduced are based on the master-worker paradigm. However, the majority of these algorithms assume that workers are dedicated machines, which is a wrong assumption in distributed environments such as Grids. In this work, ...

متن کامل

An Evaluation of Job Scheduling Strategies for Divisible Loads on Grid Platforms

In this paper we study distributed job scheduling in grid environments when each job is a DL application. The scheduling goal is to minimize the average steady-state job turnaround time. In this context, we identify in which regimes classes of scheduling strategies are efficient, namely for which platforms and which communication to computation ratios. We also quantify what level of global info...

متن کامل

Dynamic Replication based on Firefly Algorithm in Data Grid

In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...

متن کامل

Deadline-Based Scheduling Algorithm for Divisible-Load in Grid Computing

The divisible load model is motivated by divisible load theory, where both communication and computation can be arbitrarily divisible into as many independent partitions as required and facilitates a good approximation for many real-world application systems such as those arising in large physics experiments. Scheduling an application with divisible load in data grid is significantly important ...

متن کامل

Efficient Real-Time Divisible Load Scheduling with Advance Reservations

Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. With the emergence of Grid applications that require simultaneous access to multi-site resources, supporting advance reservations in a cluster has become increasingly important. While progress is being made in scheduling arbitrarily divis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCM

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2007